Characterizations of Mersenne and 2-rooted primes

نویسندگان

  • Sunil K. Chebolu
  • Keir Lockridge
  • Gaywalee Yamskulna
چکیده

Article history: Received 18 June 2014 Received in revised form 11 June 2015 Accepted 12 June 2015 Available online 22 June 2015 Communicated by Neal Koblitz MSC: primary 11A41, 11A07 secondary 15B99, 05C90

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Mersenne and Eisenstein Mersenne primes

The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given....

متن کامل

Significance of Even-oddness of a Prime's Penultimate Digit

The beauty of these relationships is that, by inspection alone, one may instantly observe whether or not a prime number is = 1, or = 3 (mod 4). These relationships are especially valuable for very large prime numbers-such as the larger Mersenne primes. Thus, it is seen from inspection of the penultimate digits of the Mersenne primes, as given in [1 ] , that all of the given primes are = 3 (mod ...

متن کامل

Three New Mersenne Primes and a Statistical Theory

If p is prime, Mp = 2P — 1 is called a Mersenne number. If ui = 4 and «<+1 = Mj+i — 2, then M„ is prime if and only if uv-i m 0(mod Mp). This is called the Lucas test (see Lehmer [4]). The primes Mom , M mi, and Mu2W which are now the largest known primes, were discovered by Illiac II at the Digital Computer Laboratory of the University of Illinois. The computing times were 1 hour 23 minutes, 1...

متن کامل

Generalization of a Theorem of Drobot

It is well known that the Fibonacci number Fn can be a prime only If n 4 or n p, where p is an odd prime. Throughout this paper, p will denote a prime. In a very interesting paper, Drobot [2] proved that Fp is composite for certain primes p. In particular, he proved that if p > 7, p = 2 or 4 (mod 5), and 2p -1 is also a prime, then 2p -11 Fp and Fp > 2p . For example, 371 Fl9 = 4181-37-113. A s...

متن کامل

Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems

We discuss side channel leakage from modular reduction for NIST recommended domain parameters. FIPS 186-2 has 5 recommended prime fields. These primes have a special form which is referred to as generalized Mersenne prime. These special form primes facilitate especially efficient implementation. A typical implementation of efficient modular reduction with such primes includes conditional reduct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Finite Fields and Their Applications

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2015